Integer programming for the generalized high school timetabling problem

Integer programming for the generalized high school timetabling problem

Recently the XHSTT format for (High) School Timetabling was introduced, which provides a uniform way of modeling problem instances and corresponding solutions. The format supports a big variety of constraints, and currently 38 real-life instances from 11 di erent countries are available. Thereby the XHSTT format serves as a common ground for researchers within this area. This paper describes th...

An Integer Programming Model for the School Timetabling Problem

This work presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters referring to teachers p...

Hybridizing Integer Programming and Metaheuristics for Solving High School Timetabling

Combining Metaheuristics and Integer Programming on School Timetabling problems

Fischetti and Lodi (2003) proposed the use of general MIP solvers to explore large neighborhoods around reference solutions. In the original article, this appeared as a branching strategy aimed at improving the practical behavior of exact methods, producing better solutions earlier. As predicted in this work, the potential of similar techniques in a heuristic context was worthy of further inves...

A SA-ILS approach for the High School Timetabling Problem

This work presents a heuristic approach proposed by one of the finalists of the Third International Timetabling Competition (ITC2011). The KHE school timetabling engine is used to generate an initial solution and then Simulated Annealing (SA) and Iterated Local Search (ILS) perform local search around this solution.